package algorithm.common;

/**
 * @Author: Hevery
 * @Description:
 * @Date: Created on 2017/9/9
 * @Modified By:
 */
import java.util.Scanner;

/**
 * @Creation_time 2017/9/9
 * @Theme Test
 * @Autor Xiao Yiyun
 */
public class Main7 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int t = scan.nextInt();
        String[] result = new String[t];
        int k = 0;
        while (t-- > 0) {
            int n = scan.nextInt();
            int[] A = new int[n];
            for (int i=0; i<n; i++) {
                A[i] = scan.nextInt();
            }
            int cnt = 0;
            int cnt1 = 0;
            int cnt2 = 0;
            for (int i=0; i<n; i++) {
                if (A[i]%2 != 0) {
                    cnt ++;
                } else if ((A[i]/2)%2 != 0) {
                    cnt1 ++;
                } else {
                    cnt2 ++;
                }
            }
            if (cnt <= cnt2) {
                result[k++] = "Yes";
            } else {
                result[k++] = "No";
            }
        }
        for (int i=0; i<result.length; i++) {
            System.out.println(result[i]);
        }
    }
}
